Type error slicing in implicitly typed higher-order languages
نویسندگان
چکیده
منابع مشابه
Type Error Slicing in Implicitly Typed Higher-Order Languages
Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that identifies the location of a type error as a set of program points (a slice) all of which are necessary for the type error. We describe algorithms for finding minimal type error slices for implicitly typed higher-order ...
متن کاملBehavioural Equivalence and Indistinguishability in Higher-Order Typed Languages
We extend the study of the relationship between behavioural equivalence and the indistinguishability relation[4, 7] to the simply typed lambda calculus, where higher-order types are available. The relationship between these two notions is established in terms of factorisability[4]. The main technical tool of this study is pre-logical relations[8], which give a precise characterisation of behavi...
متن کاملPure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. More precisely, we apply membership equational logic, the equational sublogic of rewriting logic, to specify pure type systems as they can be found in the literature and also a new variant of pure type systems with explicit names ...
متن کاملHigher-Order Lazy Functional Slicing
Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, and corresponding tools, target either the imperative or the object oriented paradigms...
متن کاملTyped Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these systems into ordinary (£rst-order) rewrite systems and the subsequent application of conventional narrowing strategies. Our translation is an adaptation to narrowing of Warren’s translation, but unlike similar previous...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2004
ISSN: 0167-6423
DOI: 10.1016/j.scico.2004.01.004